Convex Independence in Permutation Graphs
نویسندگان
چکیده
A setC of vertices of a graph is P3-convex if every vertex outside C has at most one neighbor in C. The convex hull σ(A) of a set A is the smallest P3-convex set that contains A. A setM is convexly independent if for every vertex x ∈ M, x / ∈ σ(M− x). We show that the maximal number of vertices that a convexly independent set in a permutation graph can have, can be computed in polynomial time.
منابع مشابه
ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
متن کاملConvex obstacle numbers of outerplanar graphs and bipartite permutation graphs
The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the plane (corresponding to V (G)) so that a vertex pair uv is an edge if and only if the corresponding segment uv does not meet any obstacle. We show that the disjoint convex obstacle number of an outerplanar graph is alw...
متن کاملApproximating independence polynomials of claw-free graphs
Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independenc...
متن کاملBandwidth of Convex Bipartite Graphs and Related Graphs
It is known that the bandwidth problem is NP-complete for chordal bipartite graphs, while the problem can be solved in polynomial time for bipartite permutation graphs, which is a subclass of chordal bipartite graphs. This paper shows that the problem is NP-complete even for convex bipartite graphs, a subclass of chordal bipartite graphs and a superclass of bipartite permutation graphs. We prov...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016